Congruence lattices of powers of an algebra

نویسندگان

  • Ross WILLARD
  • Evelyn Nelson
چکیده

Let ~ be a property which can be attributed to 0, 1-sublattices of Eq (X), X arbitrary. (Eq (X) is the lattice of all equivalence relations on X.) For example, could be modularity or permutability. It was proved in [3] that for every integer k 2 there is an n -> 1 such that for every algebra A of cardinality k, if Con (A m) satisfies ~ for all m -< n then Con (A m) satisfies ~ for all m. Let ne(k) denote the least such n. The open problem is: given N, to evaluate the function n~. In this paper we establish an upper bound to n~ for each of the following properties ~: permutability, distributivity, modularity and the property of being skew-flee. The upper bounds established here are much too large; for example, the bound for modularity is

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DIRECTLY INDECOMPOSABLE RESIDUATED LATTICES

The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...

متن کامل

Distributive lattices with strong endomorphism kernel property as direct sums

Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem  2.8}). We shall determine the structure of special elements (which are introduced after  Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...

متن کامل

A constructive approach to the finite congruence lattice representation problem

A finite lattice is representable if it is isomorphic to the congruence lattice of a finite algebra. In this paper, we develop methods by which we can construct new representable lattices from known ones. The techniques we employ are sufficient to show that every finite lattice which contains no three element antichains is representable. We then show that if an order polynomially complete latti...

متن کامل

FUZZY CONVEX SUBALGEBRAS OF COMMUTATIVE RESIDUATED LATTICES

In this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. In particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. Then we study fuzzy...

متن کامل

Weak Congruence Representability of Suborders and Direct Products

Here we treat the problem of representability of an algebraic lattice by the weak congruence lattice of an algebra, i.e. the lattice of all symmetric and transitive relations compatible with algebra. We prove that some suborders of the representable lattices are representable, and give conditions under which these suborders are also sublattices of the initial lattices. We also prove that the di...

متن کامل

Varieties of Algebras and their Congruence Varieties

1. Congruence lattices. G. Birkhoff and O. Frink noted that the congruence lattice Con04) of an algebra A (with operations of finite rank) is algebraic or compactly generated. The celebrated Grätzer-Schmidt theorem states that, conversely, every algebraic lattice is isomorphic to Con(A) for some algebra A. The importance of this is obvious, for it shows that unless something more is known about...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008